#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#define fill(a, c) memset(a, c, sizeof(a))
#define ldb long double
#define LL long long
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define sqr(a) ((a) * (a))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb eps = 1e-9;
const ldb LDINF = 1e70;
const LL LINF = 1ll << 60;
const int INF = 1 << 30;
const ldb pi = fabs(atan2(0.0, -1.0));
using namespace std;

int n;
string s;

void Load()
{
	cin >> n;
	cin >> s;
}


void Solve()                                                                                                          
{
	int i;
	int j;
	vector <int> a(n, 1);
	for (int i = 0; i < n - 1; i++)
	{
		if (s[i] == 'R' && a[i] >= a[i + 1])
			a[i + 1] = a[i] + 1; 
		else if (s[i] == '=' && a[i] != a[i + 1])
			a[i + 1] = a[i];
	}
	for (int i = n - 2; i >= 0; i--)
	{
		if (s[i] == 'L' && a[i] <= a[i + 1])
			a[i] = a[i + 1] + 1; 
		else if (s[i] == '=' && a[i] != a[i + 1])
			a[i] = a[i + 1];
	}
	for (i = 1; i <= n + 1; i++)
	{
		for (j = 0; j < n - 1; j++)
		{
			if (s[j] == 'L' && a[j] <= a[j + 1])
				a[j] = a[j + 1] + 1;
			else if (s[j] == 'R' && a[j] >= a[j + 1])
				a[j + 1] = a[j] + 1;
			else if (s[j] == '=' && a[j] != a[j + 1])
				a[j + 1] = a[j];
		}
	}
	for (i = 0; i < n; i++) cout << a[i] << " ";
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("a.in", "rt", stdin);
	freopen("a.out", "wt", stdout);
#endif
	Load();
	Solve();
	return 0;
}
